Sublinear Time Algorithms for Earth Mover’s Distance
نویسندگان
چکیده
منابع مشابه
Sublinear Algorithms for Earth Mover ' s Distance
We study the problem of estimating the Earth Mover's Distance (EMD) between probability distributions when given access only to samples. We give closeness testers and additive-error estimators over domains in [0, A], with sample complexities independent of domain size permitting the testability even of continuous distributions over infinite domains. Instead, our algorithms depend on other param...
متن کامل2 00 9 Sublinear Time Algorithms for Earth Mover ’ s Distance
We study the problem of estimating the Earth Mover’s Distance (EMD) between probability distributions when given access only to samples. We give closeness testers and additive-error estimators over domains in [0,∆], with sample complexities independent of domain size – permitting the testability even of continuous distributions over infinite domains. Instead, our algorithms depend on other para...
متن کاملSublinear-time Algorithms
In this paper we survey recent advances in the area of sublinear-time algorithms.
متن کاملSublinear Time Algorithms
Sublinear time algorithms represent a new paradigm in computing, where an algorithm must give some sort of an answer after inspecting only a very small portion of the input. We discuss the types of answers that one can hope to achieve in this setting.
متن کاملSublinear Time and Space Algorithms 2016B – Lecture 7 Sublinear-Time Algorithms for Sparse Graphs∗
Problem definition: Input: A graph represented (say) as the adjacency list for each vertex (or even just the degree of each vertex) Goal: Compute the average degree (equiv. number of edges) Concern: Seems to be impossible e.g. if all degrees ≤ 1, except possibly for a few vertices whose degree is about n. Theorem 1 [Feige, 2004]: There is an algorithm that estimates the average degree d of a co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2010
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-010-9265-8